Quantum algorithm of evolutionary analysis of one dimensional cellular automata
نویسندگان
چکیده
منابع مشابه
Optimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملOn One-Dimensional Quantum Cellular Automata
Since Richard Feynman introduced the notion of quantum computation in 1982, various models of \quantum computers" have been proposed. These models include quantum Turing machines and quantum circuits. In this paper we deene another quantum computational model, one-dimensional quantum cellular automata, and demonstrate that any quantum Turing machine can be eeciently simulated by a one-dimension...
متن کاملIntrinsically universal one-dimensional quantum cellular automata
We give a one-dimensional quantum cellular automata (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any one-dimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA will then correspond to one step of the simulated QCA. The simulation preserves the topology in ...
متن کاملUnitarity in One Dimensional Nonlinear Quantum Cellular Automata
Unitarity of the global evolution is an extremely stringent condition on finite state models in discrete spacetime. Quantum cellular automata, in particular, are tightly constrained. In previous work we proved a simple No-go Theorem which precludes nontrivial homogeneous evolution for linear quantum cellular automata. Here we carefully define general quantum cellular automata in order to invest...
متن کاملOne - dimensional quantum cellular automata over finite , unbounded configuration
Cellular automaton (CA) is a model of computation that use a local evolution rule to update iteratively a set of cells. Because of its connection with physics, the idea of generalizing this model with quantum effects was present very early, even already in the famous Feynman’s 1982 paper [3]. Since then, a lot of different approaches have been tried to formalize the notion of quantum cellular a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physical Studies
سال: 2011
ISSN: 1027-4642,2310-0052
DOI: 10.30970/jps.15.3001